Results about the Alexandroff duplicate space
نویسندگان
چکیده
منابع مشابه
The Centre of the Spaces of Banach Lattice-Valued Continuous Functions on the Generalized Alexandroff Duplicate
and Applied Analysis 3 where Hα is a Γ-open set, Gγ is a Σ-open set, and Mγ is a Γ-compact set. It is easy to see that {Gγ ×{0}}γ∈Ω is an open cover ofK×{0}, thus there is a finite subcoverGγ1 ×{0}, . . . , Gγn ×{0}. Then, Gγ1 × {0, 1} \Mγ1 × {1} ∪ · · · ∪Gγn × {0, 1} \Mγn × {1} 1.6 misses only finitely many Γ-compact sets Mγ1 × {1}, . . . ,Mγn × {1}. AsMγj j 1, 2, . . . , n is compact, we have...
متن کاملCores of Alexandroff Spaces
Following Kukie la, we show how to generalize some results from May’s book [4] concerning cores of finite spaces to cores of Alexandroff spaces. It turns out that finite space methods can be extended under certain local finiteness assumptions; in particular, every bounded-paths space or countable finite-paths space has a core, and two bounded-paths spaces or countable finite-paths spaces are ho...
متن کاملDetecting Duplicate Records in Scientific Workflow Results
Scientific workflows are often data intensive. The data sets obtained by enacting scientific workflows have several applications, e.g., they can be used to identify data correlations or to understand phenomena, and therefore are worth storing in repositories for future analyzes. Our experience suggests that such datasets often contain duplicate records. Indeed, scientists tend to enact the same...
متن کاملOn Duplicate Results in a Search Session
In this paper, we introduce the PITT group’s methods and findings in TREC 2012 session track. After analyzing the search logs in session track 2011 and 2012 datasets, we find that users’ reformulated queries are very different from their previous ones, probably indicating their expectations to find not only relevant but also novel results. However, as indicated from our results, a major approac...
متن کاملAn Alexandroff Topology on Graphs
Let G = (V,E) be a locally finite graph, i.e. a graph in which every vertex has finitely many adjacent vertices. In this paper, we associate a topology to G, called graphic topology of G and we show that it is an Alexandroff topology, i.e. a topology in which intersection of each family of open sets is open. Then we investigate some properties of this topology. Our motivation is to give an elem...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied General Topology
سال: 2016
ISSN: 1989-4147,1576-9402
DOI: 10.4995/agt.2016.4521